Computing rational Gauss-Chebyshev quadrature formulas with complex poles
نویسندگان
چکیده
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.
منابع مشابه
Computing rational Gauss-Chebyshev quadrature formulas with complex poles: The algorithm
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with complex poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the c...
متن کاملRational Gauss-Chebyshev quadrature formulas for complex poles outside [-1, 1]
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary real poles outside [−1, 1] to arbitrary complex poles outside [−1, 1]. The zeros of these orthogonal rational functions are not necessarily real anymore. By using the related para-orthogonal functions, however, we obtain an expression for the nodes and weights for rational Gauss-Chebyshev quadrat...
متن کاملOn computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملChebyshev series method for computing weighted quadrature formulas
In this paper we study convergence and computation of interpolatory quadrature formulas with respect to a wide variety of weight functions. The main goal is to evaluate accurately a definite integral, whose mass is highly concentrated near some points. The numerical implementation of this approach is based on the calculation of Chebyshev series and some integration formulas which are exact for ...
متن کاملIs Gauss Quadrature Better than Clenshaw-Curtis?
We compare the convergence behavior of Gauss quadrature with that of its younger brother, Clenshaw–Curtis. Seven-line MATLAB codes are presented that implement both methods, and experiments show that the supposed factor-of-2 advantage of Gauss quadrature is rarely realized. Theorems are given to explain this effect. First, following O’Hara and Smith in the 1960s, the phenomenon is explained as ...
متن کامل